Burst arrival queues with server vacations and random timers

نویسندگان

  • Merav Shomrony
  • Uri Yechiali
چکیده

We derive performance measures for burst arrival (e.g. messages of variable length packets) M / G / 1 queues with server vacations, controlled by the, so called, Randomly Timed Gated (RTG) protocol, operating as follows : Whenever the server returns from a ( general-type ) vacation and initiates a busy period, a Timer with random duration T is activated. If the server empties the queue before time T, he leaves for another vacation. Otherwise ( i.e. if there are still customers (packets) in the system when the timer expires ), two versions of terminating the busy period, each leading to a different model, are studied : (i). The server completes service (e.g. transmission) only to the customer being served at time T and leaves. (ii). The server leaves immediately. We derive both state-dependent and steady-state performance measures as a function of the (vacation-type dependent variable) number of customers present at the initiation of a busy period. When the vacation policy is specified ( i.e. Multiple or Single ), we obtain explicit formulas for the various performance measures, derive the distribution and mean of the waiting and sojourn times of a customer, and compare between the two versions. Analysis of the conditions for stability concludes the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unreliable bulk retrial queues with delayed repairs and modified vacation policy

The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...

متن کامل

Finite Capacity Queuing System with Vacations and Server Breakdowns

This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...

متن کامل

An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals

Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...

متن کامل

Perishable Inventory Model with Retrial Demands, Negative Customers and Multiple Working Vacations

This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...

متن کامل

Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations

This paper treats a discrete-time single-server finite-buffer exhaustive (singleand multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2001